An Approximation Algorithm for the Risk-Adjusted Two-Stage Stochastic Facility Location Problem with Penalties

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Approximation Algorithm for the -level Uncapacitated Facility Location Problem with Penalties

The -level Uncapacitated Facility Location (UFL) problem is a generalization of the UFL and the -median problems. A significant shortcoming of the classical UFL problem is that often a few very distant customers, known as outliers, can leave an undesirable effect on the final solution. This deficiency is considered in a new variant called UFL with outliers, in which, in contrast to the other pr...

متن کامل

Approximation algorithms for Capacitated Facility Location Problem with Penalties

In this paper, we address the problem of capacitated facility location problem with penalties (CapFLPP) paid per unit of unserved demand. In case of uncapacitated FLP with penalties demands of a client are either entirely met or are entirely rejected and penalty is paid. In the uncapacitated case, there is no reason to serve a client partially. Whereas, in case of CapFLPP, it may be beneficial ...

متن کامل

An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem

The uncapacitated facility location problem in the following formulation is considered: max S⊆I Z(S) = ∑

متن کامل

An approximation algorithm for a facility location problem with stochastic demands and inventories

In this article we propose, for any > 0, a 2(1 + )-approximation algorithm for a facility location problem with stochastic demands. This problem can be described as follows. There are a number of locations, where facilities may be opened and a number of demand points, where requests for items arise at random. The requests are sent to open facilities. At the open facilities, inventory is kept su...

متن کامل

An Approximation Algorithm for a Facility Location Problem with Inventories and Stochastic Demands

In this article we propose, for any > 0, a 2(1+ )-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. The incurred costs are the expected transportation costs from the demand points to the facilities, the operating costs of the facil...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Operations Research Society of China

سال: 2013

ISSN: 2194-668X,2194-6698

DOI: 10.1007/s40305-013-0020-0